Statistical study on the number of injective linear finite transducers

نویسندگان

  • Ivone Amorim
  • António Machiavelo
  • Rogério Reis
چکیده

The notion of linear finite transducer (LFT) plays a crucial role in some cryptographic systems. In this paper we present a way to get an approximate value, by random sampling, for the number of non-equivalent injective LFTs. By introducing a recurrence relation to count canonical LFTs, we show how to estimate the percentage of τ -injective LFTs. Several experimental results are presented, which by themselves constitute an important step towards the evaluation of the key space of those systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Number of Non-Equivalent Linear Transducers

The notion of linear finite transducer (LFT) plays a crucial role in a family of cryptosystems introduced in the 80’s and 90’s. However, as far as we know, no study was ever conducted to count and enumerate these transducers, which is essential to verify if the size of the key space, of the aforementioned systems, is large enough to prevent a exhaustive search attack. In this paper, we determin...

متن کامل

Gorenstein Injective Dimensions and Cohen-Macaulayness

Let (R,m) be a commutative noetherian local ring. In this paper we investigate the existence of a finitely generated R-module of finite Gorenstein dimension when R is Cohen-Macaulay. We study the Gorenstein injective dimension of local cohomology of complexes and next we show that if R is a non-Artinian Cohen-Macaulay ring, which does not have the minimal multiplicity, then R has a finite gener...

متن کامل

Counting Equivalent Linear Finite Transducers Using a Canonical Form

The notion of linear finite transducer (LFT) plays a crucial role in a family of cryptosystems introduced in the 80’s and 90’s. However, as far as we know, no study was ever conducted to count and enumerate these transducers, which is essential to verify if the size of the key space, of the aforementioned systems, is large enough to prevent an exhaustive search attack. In this paper, we determi...

متن کامل

A finite-state framework for log-linear models in machine translation

Log-linear models represent nowadays the state-of-the-art in statistical machine translation. There, several models are combined altogether into a whole statistical approach. Finite-state transducers constitute a special type of statistical translation model whose interest has been proved in different translation tasks. The goal of this work is to introduce a finite-state framework for a log-li...

متن کامل

Normal numbers and finite automata

We give an elementary and direct proof of the following theorem: A real number is normal to a given integer base if, and only if, its expansion in that base is incompressible by lossless finite-state compressors (these are finite automata augmented with an output transition function such that the automata input-output behaviour is injective; they are also known as injective finite-state transdu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014